Proofs of Normalizationfor the simply - typed - calculus , permutativeconversions and G
نویسندگان
چکیده
We study inductive characterizations of the sets of terms, the subset of strongly normalizing terms and normal forms in order to give short proofs of weak and strong normalization for the simply-typed-calculus and for an extension by sum types with permutative conversions. In contrast to the strong computability/candidate style a la Tait and Girard this proof can be formalized in primitive recursive arithmetic. By introducing an innnitely branching inductive rule the method extends to GG odel's T.
منابع مشابه
Initial investigations into relating Logical and Computational Calculi
2 Natural Deduction and Sequent Calculus 1 2.1 Natural Deduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 2.2 Sequent Calculus . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 2.3 Proofs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ...
متن کاملShort Proofs of Strong Normalization
This paper presents simple, syntactic strong normalization proofs for the simply-typed λ-calculus and the polymorphic λ-calculus (system F) with the full set of logical connectives, and all the permutative reductions. The normalization proofs use translations of terms and types of λ→,∧,∨,⊥ to terms and types of λ→ and from F∀,∃,→,∧,∨,⊥ to F∀,→.
متن کاملThe category of simply typed λ-terms in Agda
We present a proof in Agda that the substitutions in simply typed λ-calculus form a category which has nite products. We base our syntax on directly typed λ-calculus, without de ning rst pure λ-calculus. We use parallel substitutions, a better point of view to argue about substitutions. We show that we can reduce all the proofs to similar diagrams, that make it automatic.
متن کاملContextual Natural Deduction
This paper defines the contextual natural deduction calculus ND for the implicational fragment of intuitionistic logic. ND extends the usual natural deduction calculus (here called ND) by allowing the implication introduction and elimination rules to operate on formulas that occur inside contexts. In analogy to the Curry-Howard isomorphism between ND and the simply-typed λ-calculus, an extensio...
متن کاملFunctions as Session-Typed Processes
We study type-directed encodings of the simply-typed λ-calculus in a session-typed π-calculus. The translations proceed in two steps: standard embeddings of simply-typed λ-calculus in a linear λ-calculus, followed by a standard translation of linear natural deduction to linear sequent calculus. We have shown in prior work how to give a Curry-Howard interpretation of the proofs in the linear seq...
متن کامل